NEXP-Completeness and Universal Hardness Results for Justification Logic
نویسنده
چکیده
We provide a lower complexity bound for the satisfiability problem of a multi-agent justification logic, establishing that the general NEXP upper bound from our previous work is tight. We then use a simple modification of the corresponding reduction to prove that satisfiability for all multi-agent justification logics from there is Σ 2 -hard – given certain reasonable conditions. Our methods improve on these required conditions for the same lower bound for the single-agent justification logics, proven by Buss and Kuznets in 2009, thus answering one of their open questions.
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملJustified Terminological Reasoning
Justification logics are epistemic logics that include explicit justifications for an agent’s knowledge. In the present paper, we introduce a justification logic JALC over the description logic ALC. We provide a deductive system and a semantics for our logic and we establish soundness and completeness results. Moreover, we show that our logic satisfies the so-called internalization property sta...
متن کاملPhilipp Weis And
It is well-known that every first-order property on words is expressible using at most three variables. The subclass of properties expressible with only two variables is also quite interesting and well-studied. We prove precise structure theorems that characterize the exact expressive power of first-order logic with two variables on words. Our results apply to both the case with and without a s...
متن کاملStructure Theorem and Strict Alternation Hierarchy for FO2 on Words
It is well-known that every first-order property on words is expressible using atmost three variables. The subclass of properties expressible with only two variables is alsoquite interesting and well-studied. We prove precise structure theorems that characterizethe exact expressive power of first-order logic with two variables on words. Our resultsapply to both the case with and...
متن کاملComputational Aspects of Dependence Logic
In this thesis (modal) dependence logic is investigated. It was introduced in 2007 by Jouko Väänänen as an extension of first-order (resp. modal) logic by the dependence operator “p ̈q. For first-order (resp. propositional) variables x1, . . . , xn, “px1, . . . , xn ́1, xnq intuitively states that the value of xn is determined by those of x1, . . . , xn ́1. We consider fragments of modal dependenc...
متن کامل